partial evaluation - определение. Что такое partial evaluation
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое partial evaluation - определение

TECHNIQUE FOR PROGRAM OPTIMIZATION
Partial Evaluation; Futamura projection; Partial evaluator; Yoshihiko Futamura
Найдено результатов: 819
partial evaluation         
<compiler, algorithm> (Or "specialisation") An optimisation technique where the compiler evaluates some subexpressions at compile-time. For example, pow x 0 = 1 pow x n = if even n then pxn2 * pxn2 else x * pow x (n-1) where pxn2 = pow x (n/2) f x = pow x 5 Since n is known we can specialise pow in its second argument and unfold the recursive calls: pow5 x = x * x4 where x4 = x2 * x2 x2 = x * x f x = pow5 x pow5 is known as the residual. We could now also unfold pow5 giving: f x = x * x4 where x4 = x2 * x2 x2 = x * x It is important that the partial evaluation algorithm should terminate. This is not guaranteed in the presence of recursive function definitions. For example, if partial evaluation were applied to the right hand side of the second clause for pow above, it would never terminate because the value of n is not known. Partial evaluation might change the termination properties of the program if, for example, the expression (x * 0) was reduced to 0 it would terminate even if x (and thus x * 0) did not. It may be necessary to reorder an expression to partially evaluate it, e.g. f x y = (x + y) + 1 g z = f 3 z If we rewrite f: f x y = (x + 1) + y then the expression x+1 becomes a constant for the function g and we can say g z = f 3 z = (3 + 1) + z = 4 + z Partial evaluation of built-in functions applied to constant arguments is known as constant folding. See also full laziness. (1999-05-25)
Partial evaluation         
In computing, partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward application is to produce new programs that run faster than the originals while being guaranteed to behave in the same way.
Partial derivative         
DERIVATIVE OF A FUNCTION OF SEVERAL VARIABLES WITH RESPECT TO ONE VARIABLE, WITH THE OTHERS HELD CONSTANT
Partial Derivatives; Partial derivatives; Partial differentiation; Partial derivation; Mixed partial derivatives; Mixed derivatives; Partial Derivative; Mixed partial derivative; Partial differential; Partial symbol; Partial differentiation; Del (∂); Cross derivative
In mathematics, a partial derivative of a function of several variables is its derivative with respect to one of those variables, with the others held constant (as opposed to the total derivative, in which all variables are allowed to vary). Partial derivatives are used in vector calculus and differential geometry.
partial derivative         
DERIVATIVE OF A FUNCTION OF SEVERAL VARIABLES WITH RESPECT TO ONE VARIABLE, WITH THE OTHERS HELD CONSTANT
Partial Derivatives; Partial derivatives; Partial differentiation; Partial derivation; Mixed partial derivatives; Mixed derivatives; Partial Derivative; Mixed partial derivative; Partial differential; Partial symbol; Partial differentiation; Del (∂); Cross derivative
¦ noun Mathematics a derivative of a function of two or more variables with respect to one variable, the other(s) being treated as constant.
Partial fraction decomposition         
DECOMPOSITION OR PARTIAL FRACTION EXPANSION OF A MATHEMATICAL FUNCTION
Partial fractions in integration; Partial fraction decomposition over the reals; Partial fraction decomposition over R; Partial fractions; Partial Fraction Decomposition; Partial fraction expansion; Partial Fractions; Partial Fraction; Integration by partial fractions; Partial fractions decomposition; Method of partial fractions; Partial fraction
In algebra, the partial fraction decomposition or partial fraction expansion of a rational fraction (that is, a fraction such that the numerator and the denominator are both polynomials) is an operation that consists of expressing the fraction as a sum of a polynomial (possibly zero) and one or several fractions with a simpler denominator.
Evaluation function         
FUNCTION RETURNING ESTIMATED VALUE OF A POSITION IN A GAME PLAYING PROGRAM
Static evaluation function; Heuristic evaluation function; Piece-square table
An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position (usually at a leaf or terminal node) in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.
Partial application         
IN FUNCTIONAL PROGRAMMING
Papply; Partial apply; Partial function application
In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments to a function, producing another function of smaller arity. Given a function f \colon (X \times Y \times Z) \to N , we might fix (or 'bind') the first argument, producing a function of type \text{partial}(f) \colon (Y \times Z) \to N .
Course evaluation         
QUESTIONNAIRE COMPLETED BY STUDENTS TO EVALUATE AN ACADEMIC COURSE
Course evaluations; Student evaluations; Training Evaluation; Trainer Evaluation; Student Evaluation; Instructor Evaluation; Learning evaluation
A course evaluation is a paper or electronic questionnaire, which requires a written or selected response answer to a series of questions in order to evaluate the instruction of a given course. The term may also refer to the completed survey form or a summary of responses to questionnaires.
Partial molar property         
  • Water and ethanol always have negative excess volumes when mixed, indicating the partial molar volume of each component is less when mixed than its molar volume when pure.
Partial molar volume; Volume of mixing; Molar partial enthalpy; Partial molar enthalpy; Partial molar entropy; Partial molar internal energy; Partial molar gibbs energy; Partial molar Gibbs free energy; Partial molar quantities; Partial molar quantity
In thermodynamics, a partial molar property is a quantity which describes the variation of an extensive property of a solution or mixture with changes in the molar composition of the mixture at constant temperature and pressure. It is the partial derivative of the extensive property with respect to the amount (number of moles) of the component of interest.
Partial volume (imaging)         
LOSS OF APPARENT ACTIVITY IN SMALL OBJECTS OR REGIONS
Partial volume effect
The partial volume effect can be defined as the loss of apparent activity in small objects or regions because of the limited resolution of the imaging system. It occurs in medical imaging and more generally in biological imaging such as positron emission tomography (PET) and single-photon emission computed tomography (SPECT).

Википедия

Partial evaluation

In computing, partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward application is to produce new programs that run faster than the originals while being guaranteed to behave in the same way.

A computer program prog is seen as a mapping of input data into output data:

p r o g : I static × I dynamic O , {\displaystyle prog:I_{\text{static}}\times I_{\text{dynamic}}\to O,}

where I static {\displaystyle I_{\text{static}}} , the static data, is the part of the input data known at compile time.

The partial evaluator transforms p r o g , I static {\displaystyle \langle prog,I_{\text{static}}\rangle } into p r o g : I dynamic O {\displaystyle prog^{*}:I_{\text{dynamic}}\to O} by precomputing all static input at compile time. p r o g {\displaystyle prog^{*}} is called the "residual program" and should run more efficiently than the original program. The act of partial evaluation is said to "residualize" p r o g {\displaystyle prog} to p r o g {\displaystyle prog^{*}} .